Dictionaries Revisited
نویسنده
چکیده
Dictionaries are probably the most well studied class of data structures. A dictionary supports insertions, deletions, membership queries, and usually successor, predecessor, and extract-min. Given their centrality to both the theory and practice of data structures, surprisingly basic questions about them remain unsolved and sometimes even unposed. This talk focuses on questions that arise from the disparity between the way large-scale dictionaries are analyzed and the way they are used in practice. 1998 ACM Subject Classification E.1 Data Structures
منابع مشابه
Lexical Affect Sensing: Word Spotting Revisited
Recently, there has been considerable interest in the recognition of affect from texts. In this paper, we revisit the word spotting technique for affect sensing in short texts, for which purpose, we extract words from different affect dictionaries and explore the performance of various strategies for sensing affect.
متن کاملOn multiword lexical units and their role in maritime dictionaries
Multi-word lexical units are a typical feature of specialized dictionaries, in particular monolingual and bilingual maritime dictionaries. The paper studies the concept of the multi-word lexical unit and considers the similarities and differences of their selection and presentation in monolingual and bilingual maritime dictionaries. The work analyses such issues as the classification of multi-w...
متن کاملMedical Students’ Perception of Using Electronic Learning Tools in an ESP Program
Given the burgeoning interest in the use of technology and electronic tools for educational purposes among students, this study set out with the purpose of investigating medical students’ perception of using e-learning tools and applications in an English for Specific Purposes (ESP) program at an Iranian medical university. The study also aimed to discover the extent to which the students...
متن کاملCase Revisited: In the Shadow of Automatic Processing of Machine-Readable Dictionaries
This paper discusses the work of automatexperiencer; if a person who uses this concept ically extracting Case Frames from Machinebelieves that seeing is a process of active selecReadable Dictionaries based on a three layer tion, then this person will assign to its subject, a posteriori Case Theory[5]. an active Case such as agent. The theory is intended to deal with two 3. c o n t e x t layer :...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017